Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

and2(true, X) -> X
and2(false, Y) -> false
if3(true, X, Y) -> X
if3(false, X, Y) -> Y
add2(0, X) -> X
add2(s1(X), Y) -> s1(add2(X, Y))
first2(0, X) -> nil
first2(s1(X), cons2(Y, Z)) -> cons2(Y, first2(X, Z))
from1(X) -> cons2(X, from1(s1(X)))

Q is empty.


QTRS
  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

and2(true, X) -> X
and2(false, Y) -> false
if3(true, X, Y) -> X
if3(false, X, Y) -> Y
add2(0, X) -> X
add2(s1(X), Y) -> s1(add2(X, Y))
first2(0, X) -> nil
first2(s1(X), cons2(Y, Z)) -> cons2(Y, first2(X, Z))
from1(X) -> cons2(X, from1(s1(X)))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS
  ↳ Non-Overlap Check
QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

and2(true, X) -> X
and2(false, Y) -> false
if3(true, X, Y) -> X
if3(false, X, Y) -> Y
add2(0, X) -> X
add2(s1(X), Y) -> s1(add2(X, Y))
first2(0, X) -> nil
first2(s1(X), cons2(Y, Z)) -> cons2(Y, first2(X, Z))
from1(X) -> cons2(X, from1(s1(X)))

The set Q consists of the following terms:

and2(true, x0)
and2(false, x0)
if3(true, x0, x1)
if3(false, x0, x1)
add2(0, x0)
add2(s1(x0), x1)
first2(0, x0)
first2(s1(x0), cons2(x1, x2))
from1(x0)


Q DP problem:
The TRS P consists of the following rules:

ADD2(s1(X), Y) -> ADD2(X, Y)
FIRST2(s1(X), cons2(Y, Z)) -> FIRST2(X, Z)
FROM1(X) -> FROM1(s1(X))

The TRS R consists of the following rules:

and2(true, X) -> X
and2(false, Y) -> false
if3(true, X, Y) -> X
if3(false, X, Y) -> Y
add2(0, X) -> X
add2(s1(X), Y) -> s1(add2(X, Y))
first2(0, X) -> nil
first2(s1(X), cons2(Y, Z)) -> cons2(Y, first2(X, Z))
from1(X) -> cons2(X, from1(s1(X)))

The set Q consists of the following terms:

and2(true, x0)
and2(false, x0)
if3(true, x0, x1)
if3(false, x0, x1)
add2(0, x0)
add2(s1(x0), x1)
first2(0, x0)
first2(s1(x0), cons2(x1, x2))
from1(x0)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
QDP
          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ADD2(s1(X), Y) -> ADD2(X, Y)
FIRST2(s1(X), cons2(Y, Z)) -> FIRST2(X, Z)
FROM1(X) -> FROM1(s1(X))

The TRS R consists of the following rules:

and2(true, X) -> X
and2(false, Y) -> false
if3(true, X, Y) -> X
if3(false, X, Y) -> Y
add2(0, X) -> X
add2(s1(X), Y) -> s1(add2(X, Y))
first2(0, X) -> nil
first2(s1(X), cons2(Y, Z)) -> cons2(Y, first2(X, Z))
from1(X) -> cons2(X, from1(s1(X)))

The set Q consists of the following terms:

and2(true, x0)
and2(false, x0)
if3(true, x0, x1)
if3(false, x0, x1)
add2(0, x0)
add2(s1(x0), x1)
first2(0, x0)
first2(s1(x0), cons2(x1, x2))
from1(x0)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 3 SCCs.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM1(X) -> FROM1(s1(X))

The TRS R consists of the following rules:

and2(true, X) -> X
and2(false, Y) -> false
if3(true, X, Y) -> X
if3(false, X, Y) -> Y
add2(0, X) -> X
add2(s1(X), Y) -> s1(add2(X, Y))
first2(0, X) -> nil
first2(s1(X), cons2(Y, Z)) -> cons2(Y, first2(X, Z))
from1(X) -> cons2(X, from1(s1(X)))

The set Q consists of the following terms:

and2(true, x0)
and2(false, x0)
if3(true, x0, x1)
if3(false, x0, x1)
add2(0, x0)
add2(s1(x0), x1)
first2(0, x0)
first2(s1(x0), cons2(x1, x2))
from1(x0)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
QDP
                ↳ QDPAfsSolverProof
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FIRST2(s1(X), cons2(Y, Z)) -> FIRST2(X, Z)

The TRS R consists of the following rules:

and2(true, X) -> X
and2(false, Y) -> false
if3(true, X, Y) -> X
if3(false, X, Y) -> Y
add2(0, X) -> X
add2(s1(X), Y) -> s1(add2(X, Y))
first2(0, X) -> nil
first2(s1(X), cons2(Y, Z)) -> cons2(Y, first2(X, Z))
from1(X) -> cons2(X, from1(s1(X)))

The set Q consists of the following terms:

and2(true, x0)
and2(false, x0)
if3(true, x0, x1)
if3(false, x0, x1)
add2(0, x0)
add2(s1(x0), x1)
first2(0, x0)
first2(s1(x0), cons2(x1, x2))
from1(x0)

We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

FIRST2(s1(X), cons2(Y, Z)) -> FIRST2(X, Z)
Used argument filtering: FIRST2(x1, x2)  =  x2
cons2(x1, x2)  =  cons1(x2)
Used ordering: Quasi Precedence: trivial


↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
                ↳ QDPAfsSolverProof
QDP
                    ↳ PisEmptyProof
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

and2(true, X) -> X
and2(false, Y) -> false
if3(true, X, Y) -> X
if3(false, X, Y) -> Y
add2(0, X) -> X
add2(s1(X), Y) -> s1(add2(X, Y))
first2(0, X) -> nil
first2(s1(X), cons2(Y, Z)) -> cons2(Y, first2(X, Z))
from1(X) -> cons2(X, from1(s1(X)))

The set Q consists of the following terms:

and2(true, x0)
and2(false, x0)
if3(true, x0, x1)
if3(false, x0, x1)
add2(0, x0)
add2(s1(x0), x1)
first2(0, x0)
first2(s1(x0), cons2(x1, x2))
from1(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
QDP
                ↳ QDPAfsSolverProof

Q DP problem:
The TRS P consists of the following rules:

ADD2(s1(X), Y) -> ADD2(X, Y)

The TRS R consists of the following rules:

and2(true, X) -> X
and2(false, Y) -> false
if3(true, X, Y) -> X
if3(false, X, Y) -> Y
add2(0, X) -> X
add2(s1(X), Y) -> s1(add2(X, Y))
first2(0, X) -> nil
first2(s1(X), cons2(Y, Z)) -> cons2(Y, first2(X, Z))
from1(X) -> cons2(X, from1(s1(X)))

The set Q consists of the following terms:

and2(true, x0)
and2(false, x0)
if3(true, x0, x1)
if3(false, x0, x1)
add2(0, x0)
add2(s1(x0), x1)
first2(0, x0)
first2(s1(x0), cons2(x1, x2))
from1(x0)

We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

ADD2(s1(X), Y) -> ADD2(X, Y)
Used argument filtering: ADD2(x1, x2)  =  x1
s1(x1)  =  s1(x1)
Used ordering: Quasi Precedence: trivial


↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPAfsSolverProof
QDP
                    ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

and2(true, X) -> X
and2(false, Y) -> false
if3(true, X, Y) -> X
if3(false, X, Y) -> Y
add2(0, X) -> X
add2(s1(X), Y) -> s1(add2(X, Y))
first2(0, X) -> nil
first2(s1(X), cons2(Y, Z)) -> cons2(Y, first2(X, Z))
from1(X) -> cons2(X, from1(s1(X)))

The set Q consists of the following terms:

and2(true, x0)
and2(false, x0)
if3(true, x0, x1)
if3(false, x0, x1)
add2(0, x0)
add2(s1(x0), x1)
first2(0, x0)
first2(s1(x0), cons2(x1, x2))
from1(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.